Weighted Automata over Vector Spaces

In this paper we deal with three models of weighted automata that take weights in the field of real numbers. The first of these models are classical weighted finite automata, the second one are crisp-deterministic weighted automata, and the third one are weighted automata over a vector space. We explore the interrelationships between weighted automata over a vector space and other two models.Comment: In Proceedings AFL 2023, arXiv:2309.0112

Heuristic algorithm for single resource constrained project scheduling problem based on the dynamic programming

We introduce a heuristic method for the single resource constrained project scheduling problem, based on the dynamic programming solution of the knapsack problem. This method schedules projects with one type of resources, in the non-preemptive case: once started an activity is not interrupted and runs to completion. We compare the implementation of this method with well-known heuristic scheduling method, called Minimum Slack First (known also as Gray-Kidd algorithm), as well as with Microsoft Project